//Predefine file
#include "ErrorType.h"
// #include "compare.h"
// #include "visit.h"

#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0

typedef int Status;
typedef struct LNode *Link,*Position;
struct LNode{ // Node Type
	int Num;	// ElemType data;
	struct LNode *next;
};
typedef struct{
	Link head,tail;
	int len; // Indicates the number of elements in the linear list
}LinkList;

// Status MakeNode(Link &p, ElemType e);
Status MakeNode(Link *p, int num);
void FreeNode(Link *p);

Status IniList(LinkList *L);
Status DestroyList(LinkList *L);
Status ClearList(LinkList *L);
Status InsFirst(Link h, Link s);// 不必改变首尾节点
Status DelFirst(Link h, Link *q);
Status Append(LinkList *L, Link s);

// struct person{
	// struct PersonalInfo{
	// 	name[1000] = "黄志烨"
	// 	pinyin[1000] = "huangzhiye";
	// }
	// struct contact{
	// 	PhoneNumber[1000] = "13828081666";
	// 	struct SocialAccount{
	// 		QQ[1000] = "453419064";
	// 	}
	// }
// }
// char *a[1000] = {"name","pinyin","phonenumber","qq"}

